Multilevel Preconditioners Constructed From Inverse-Based ILUs

نویسندگان

  • Matthias Bollhöfer
  • Yousef Saad
چکیده

This paper analyzes dropping strategies in a multilevel incomplete LU decomposition context and presents a few of strategies for obtaining related ILUs with enhanced robustness. The analysis shows that the Incomplete LU factorization resulting from dropping small entries in Gaussian elimination produces a good preconditioner when the inverses of these factors have norms that are not too large. As a consequence a few strategies are developed whose goal is to achieve this feature. A number of “templates” for enabling implementations of these factorizations are presented. Numerical experiments show that the resulting ILUs offer a good compromise between robustness and efficiency.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallelization of Multilevel Preconditioners Constructed from Inverse-Based ILUs on Shared-Memory Multiprocessors

c © 2007 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...

متن کامل

ILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms

In this paper‎, ‎an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms‎. ‎We use different drop tolerance parameters to compute the preconditioners‎. ‎To study the effect of such a dropping on the quality of the ILU ...

متن کامل

A Class of Parallel Multilevel Sparse Approximate Inverse Preconditioners for Sparse Linear Systems

We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. We do not use independent set ordering, but a diagonal dominance based matrix permutation to build a multilevel structure. The purpose of introducing multilevel structure into SAI is to enhance the robustness of SAI for...

متن کامل

Substructuring Preconditioning for Finite Element Approximations of Second Order Elliptic Problems. Ii. Mixed Method for an Elliptic Operator with Scalar Tensor

Abstract This work continues the series of papers in which new approach of constructing alge braic multilevel preconditioners for mixed nite element methods for second order elliptic problems with tensor coe cients on general grid is proposed The linear system arising from the mixed meth ods is rst algebraically condensed to a symmetric positive de nite system for Lagrange multipliers which cor...

متن کامل

Multilevel Preconditioners for Mixed Methods for Second Order Elliptic Problems

A new approach of constructing algebraic multilevel preconditioners for mixed nite element methods for second order elliptic problems with tensor coe cients on general geometry is proposed The linear system arising from the mixed methods is rst algebraically condensed to a symmetric positive de nite system for Lagrange multipliers which corresponds to a linear system generated by standard nonco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2006